Refine your search
Collections
Co-Authors
Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Meetei, Oinam Nickson
- An Application of Non-uniform Cellular Automata for Efficient Cryptography
Abstract Views :641 |
PDF Views:0
Authors
Affiliations
1 Department of Computer Science & Engineering Bharath University, Chennai
1 Department of Computer Science & Engineering Bharath University, Chennai
Source
Indian Journal of Science and Technology, Vol 6, No S5 (2013), Pagination: 4560-4566Abstract
One of the core issues for robust cryptographic systems is to deal with the rate of diffusion and distribution of keys. We try to strengthen this aspect by increasing the length of block ciphers. We present a new encryption and decryption algorithm for block cipher that supports 27 bit block size. All components in our system are chosen to be based on cellular automata so as to achieve higher parallelism and to simplify the in hardware and software implementation for applications with high degree of security. The main objective of this paper is to increase the complexity by novel schemes of mixing (reversible cellular automata) RCA and (non-uniform reversible cellular automata) NRCA. We apply set of different bit permutation methods for this purpose .This paper establishes the proof for existence of yet another approach for a high quality pseudorandom bit sequences generated by non uniform cellular automata.Keywords
Cryptographic System, NRCA-non Reversible CA, Pseudorandom Number, RCA-reversible Cellular AutomataReferences
- Schneier B (1996). Applied cryptography, Wiley, New York.
- Tripathy S, and Nandi S (2009). LCASE: Lightweight Cellular Lightweight Cellular Automata-based Symmetric-key Encryption, International Journal of Network Security, vol 8(2), 243–252.
- Sarkar P (2000). A brief history of cellular automata, Journal of ACM Computing Surveys (CSUR), vol 32(1), 80–107.
- Wolfram S (1986). Cryptography with cellular automata, Crypto ‘85, LNCS 218, Springer-verlag, 429–432.
- Wolfram S (1986). Random sequence generation by cellular automata, Advances in Applied Mathematics, vol 7(2), 123–169.
- Seredynski F, Bouvry P et al. (2004). Cellular automata computations and secret key cryptography, Parallel Computing Journal, vol 30(5-6), 753–766.
- Standaert F, Piret G et al. (2004). ICEBERG : An involutional cipher efficient for block encryption in reconfigurable hard- ware, FSE ‘04, LNCS 3017, Springer- verlag, 279–299.
- Sklavos N, Moldovyan N A et al. (2005). High speed networking security: Design and implementation of two new DDP-based ciphers, Mobile Networks and Applications-MONET, vol 25(1-2), 219–231.
- Moldovyan N A, Moldovyan P A et al. (2007). On software implementation of fast DDP-based ciphers, International Journal of Network Security, vol 4(1), 81–89.
- Toffoli T, and Margolus N (2001). Invertible cellular automata: A review, Physica D, vol 45(1–3), 229–253, (Reprinted with correction as of Oct).